Normal basis multiplication algorithm for GF(2n)
نویسندگان
چکیده
منابع مشابه
Normal Basis Multiplication Algorithm for GF ( 2 n ) ( Full Version )
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملDesign of Word Level Multiplication Algorithm on Reordered Normal Basis
Normal basis is widely used for representation of binary field elements Much attention has been paid to trade off between time and number of gates, but until little attention has been paid to the problem of connecting the gates in economical and regular way to minimize chip and chip area and design costs. Two new level high speed architectures, reordered normal basis type-I and reordered normal...
متن کاملReducing the Complexity of Normal Basis Multiplication
In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF(2) expressed in a normal basis. The number of XOR gates for the proposed multiplication algorithm is fewer than that of the optimal normal basis multiplication, not taking into account the cost of forward and backward transformations. The algorithm is more suitable ...
متن کاملTwo Software Normal Basis Multiplication Algorithms for GF(2n)
In this paper, two different normal basis multiplication algorithms for software implementation are proposed over GF(2). The first algorithm is suitable for high complexity normal bases and the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. The ANSI C source program is also included in this paper. Index Terms Finite field, normal basis, multiplication ...
متن کاملNormal Basis Multiplication Algorithms for GF(2n) (Full Version)
In this paper, we propose a new normal basis multiplication algorithm for GF(2). This algorithm can be used to design not only fast software algorithms but also low complexity bit-parallel multipliers in some GF(2)s. Especially, for some values of n that no Gaussian normal basis exists in GF(2), i.e., 8|n, this algorithm provides an alternative way to construct low complexity normal basis multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2004
ISSN: 0013-5194
DOI: 10.1049/el:20045333